Theorem (Khachiyan, 1979)

Assume $n=d$. The ellipsoid method solves any linear program with $L$-bit integer-valued constraints exactly in $O(n^4 L)$ time.

Compare: Theorem (Karmarkar, 1984)